Erratum to: Computationally tractable approximate and smoothed Polya trees
نویسندگان
چکیده
منابع مشابه
Computationally tractable pairwise complexity profile
Quantifying the complexity of systems consisting of many interacting parts has been an important challenge in the field of complex systems in both abstract and applied contexts. One approach, the complexity profile, is a measure of the information to describe a system as a function of the scale at which it is observed. We present a new formulation of the complexity profile, which expands its po...
متن کاملA Computationally Tractable Terminological Logic
Terminological Logics are knowledge representation formalisms of enormous applicative interest, as they are specifically oriented to the vast class of application domains that are describable by means of taxonomic organizations of complex objects. A number of results relative to the computational complexity of terminological logics have recently appeared in the literature. Unfortunately, most o...
متن کاملL. Breuer: Two Examples for Computationally Tractable Periodic Queues Two Examples for Computationally Tractable Periodic Queues
Abstract: In the present paper, the periodic queue is analyzed. This queue has a periodic BMAP arrival process, which is defined in this paper, and exponential service time distributions with service rates varying periodically in time. The transient distribution and several formulae for its efficient computation are derived. Furthermore, a stability condition in terms of arrival and service rat...
متن کاملWhen are probabilistic programs probably computationally tractable?
We study the computational complexity of Bayesian inference through the lens of simulating probabilistic programs. Our approach is grounded in new conceptual hypotheses about some intrinsic drivers of computational complexity, drawn from the experience of computational Bayesian statisticians. We sketch a research program to address two issues, via a combination of theory and experiments: (a) Wh...
متن کاملClassification Of Computationally Tractable Weighted Voting Games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2016
ISSN: 0960-3174,1573-1375
DOI: 10.1007/s11222-016-9686-6